Irreducible Subcube Partitions
نویسندگان
چکیده
A subcube partition is a of the Boolean cube $\{0,1\}^n$ into subcubes. irreducible if only sub-partitions whose union are singletons and entire partition. tight it “mentions” all coordinates.
 We study extremal properties partitions: minimal size, weight, maximal number points, minimum dimension. also consider existence homogeneous partitions, in which subcubes have same dimensions. additionally partitions $\{0,\dots,q-1\}^n$, $\mathbb{F}_2^n$ affine subspaces, both cases focusing on size.
 Our constructions computer experiments lead to several conjectures values aforementioned properties.
منابع مشابه
Computing Graph Properties by Randomized Subcube Partitions
We prove a new lower bound on the randomized decision tree complexity of monotone graph properties. For a monotone graph property $A$ of graphs on $n$ vertices, let $p=p(A)$ denote the threshold probability of $A$, namely the value of $p$ for which a random graph from $G(n,p)$ has property $A$ with probability $1/2$. Then the expected number of queries made by any decision tree for $A$ on such ...
متن کاملIrreducible Partitions and the Construction of Quasi-measures
A quasi-measure is a non-subadditive measure defined on only open or closed subsets of a compact Hausdorf space. We investigate the nature of irreducible partitions as defined by Aarnes and use the results to construct quasi-measures when g(X) = 1. The cohomology ring is an important tool for this investigation.
متن کاملSubcube Fault-Tolerance in Hypercubes
We consider the problem of determining the minimum number of faulty processors, (n;m), and of faulty links, (n;m), in an n-dimensional hypercube computer so that every m-dimensional subcube is faulty. Best known lower bounds for (n;m) and (n;m) are proved, several new recursive inequalities and new upper bounds are established, their asymptotic behavior for xed m and for xed n m are analyzed, a...
متن کاملSubcube Determination in Faulty Hypercubes
A hypercube may operate in a gracefully degraded manner, after faults arise, by supporting the execution of parallel algorithms in smaller fault-free subcubes. In order to reduce execution slowdown in a hypercube with given faults, it is essential to identify the maximum healthy subcubes in the faulty hypercube because the time for executing a parallel algorithm tends to depend on the dimension...
متن کاملSubcube Fault Tolerance in Hypercube Multiprocessors
In this paper, we study the problem of constructing subcubes in faulty hypercubes. First a divide-and-conquer technique is used to form the set of disjoint subcubes in the faulty hypercube. The concept of irregular subcubes is then introduced to take advantage of advanced switching techniques, such as wormhole routing, to increase the sizes of the available subcubes. We present a subcube partit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Combinatorics
سال: 2023
ISSN: ['1077-8926', '1097-1440']
DOI: https://doi.org/10.37236/11862